Parallelizing random-walk based model checking
نویسندگان
چکیده
منابع مشابه
Random Walk Based Heuristic Algorithms for Distributed Memory Model Checking
Model checking techniques suffer from the state space explosion problem: as the size of the system being verified increases, the total state space of the system increases exponentially. Some of the methods that have been devised to tackle this problem are partial order reduction, symmetry reduction, hash compaction, selective state caching, etc. One approach to the problem that has gained inter...
متن کاملExemplar-Based Random-Walk Model 1 An Exemplar-Based Random-Walk Model of Categorization and Recognition
Exemplar-Based Random-Walk Model 2 Abstract A fundamental issue in cognitive psychology and cognitive science concerns the manner in which people represent categories in memory and make decisions about category membership. In this chapter we provide a review of a process-oriented mathematical model of categorization known as the exemplar-based random-walk (EBRW) model (Nosofsky & Palmeri, 1997a...
متن کاملParallelizing a Symbolic Compositional Model-Checking Algorithm
We describe a parallel, symbolic, model-checking algorithm, built around a compositional reasoning method. The method constructs a collection of per-process (i.e., local) invariants, which together imply a desired global safety property. The local invariant computation is a simultaneous fixpoint evaluation, which easily lends itself to parallelization. Moreover, locality of reasoning helps limi...
متن کاملModel Checking Tools for Parallelizing Compilers
In this paper we apply temporal logic and model checking to analyze the structure of a source program represented as a process graph. The nodes of this graph are sequential processes whose computations are speciied as transition systems; the edges are dependence ((ow and control) relations between the computations at the nodes. This process graph is used as an intermediate source program repres...
متن کاملModel Checking by Random
While model checking algorithms are in theory ee-cient, they are in practice hampered by the explosive growth of system models. We show that for certain speciications the model cheking problem reduces to a question of reachability in the system state-transition graph, and apply a simple, randomized algorithm to this problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science and Technology Development Journal
سال: 2015
ISSN: 1859-0128,1859-0128
DOI: 10.32508/stdj.v18i1.879